Symmetry of the Barochronous Motions of a Gas

We study the system of nonlinear differential equations which expresses the constancy of the algebraic invariants of the Jacobian matrix for smooth vector fields in three-dimensional space. This system is equivalent to the equations of gas dynamics which describe the barochronous motions of a gas (the pressure and density depend only on the time). We present the results of computation of the admissible local Lie group and construction of the general solution of the system. We mention a few new problems that arise here.     

Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.     

A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.     

A novel method for automated grid generation of ice shapes for local‐flow analysis

Modelling a complex geometry, such as ice roughness, plays a key role for the computational flow analysis over rough surfaces. This paper presents two enhancement ideas in modelling roughness geometry for local flow analysis over an aerodynamic surface. The first enhancement is use of the leading‐edge region of an airfoil as a perturbation to the parabola surface. The reasons for using a parabola as the base geometry are: it resembles the airfoil leading edge in the vicinity of its apex and it allows the use of a lower apparent Reynolds number. The second enhancement makes use of the Fourier analysis for modelling complex ice roughness on the leading edge of airfoils. This method of modelling provides an analytical expression, which describes the roughness geometry and the corresponding derivatives. The factors affecting the performance of the Fourier analysis were also investigated. It was shown that the number of sine–cosine terms and the number of control points are of importance. Finally, these enhancements are incorporated into an automated grid generation method over the airfoil ice accretion surface. The validations for both enhancements demonstrate that they can improve the current capability of grid generation and computational flow field analysis around airfoils with ice roughness. Copyright © 2004 John Wiley & Sons, Ltd.     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003     

Finding Robust Solutions Using Local Search

This paper investigates how a local search metaheuristic for continuous optimisation can be adapted so that it finds broad peaks, corresponding to robust solutions. This is relevant in problems in which uncertain or noisy data is present. When using a genetic or evolutionary algorithm, it is standard practice to perturb solutions once before evaluating them, using noise from a given distribution. This approach however, is not valid when using population-less techniques like local search and other heuristics that use local search. For those algorithms to find robust solutions, each solution needs to be perturbed and evaluated several times, and these evaluations need to be combined into a measure of robustness. In this paper, we examine how many of these evaluations are needed to reliably find a robust solution. We also examine the effect of the parameters of the noise distribution. Using a simple tabu search procedure, the proposed approach is tested on several functions found in the literature. This revised version was published online in August 2006 with corrections to the Cover Date.     

局部域上的仿交换算子与Schatten类性质

设Tb^s是局部域K上带符号b的仿交换算子，本文证明了当Tb^st定义式中函数A（ξ，η）满足一定的条件时，Tb^st∈Sp的充要条件是b∈Bp^s t 1/p。     

Local chain‐configuration dependence of the mechanisms of the chemical reaction of poly(vinyl chloride). IX. Novel results on stereoselectivity of chlorination reaction

A poly(vinyl chloride) (PVC) sample was chlorinated in solution in the presence of 2,2′‐azobisisobutyronitrile and by the fluid‐bed method. The aim was to evaluate the scope of the stereoselectivity of the chlorination reaction. The quantitative microstructural analysis of the residual PVC with a degree of chlorination was followed by ¹³C NMR spectroscopy. From the evolution of the content of isotactic (mm), heterotactic (mr), and syndiotactic (rr) triads and of mmmm, mmmr, and rmmr isotactic pentads in the unchlorinated parts of the polymer, it was unambiguously inferred that the chlorination reaction proceeds by a stereoselective mechanism in that the mr heterotactic triads are the most reactive structures followed by the isotactic triad at mmmr and rmmr pentads. This conclusion was confirmed on the basis of the Fourier transform infrared results. The results provide valuable information regarding the effect of tacticity and related local conformations in the chemical reactions of PVC. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 508–519, 2003     

Structures and syntheses of layered and framework amine-bearing uranyl phosphate and uranyl arsenates

Two hydrated uranyl arsenates and a uranyl phosphate were synthesized by hydrothermal methods in the presence of amine structure-directing agents and their structures determined: (N₂C₆H₁₄)[(UO₂)(AsO₄)]₂(H₂O)₃, DabcoUAs, {NH(C₂H₅)₃}[(UO₂)₂(AsO₄)(AsO₃OH)], TriethUAs, and (N₂C₄H₁₂)(UO₂)[(UO₂)(PO₄)]₄(H₂O)₂, PiperUP. Intensity data were collected at room temperature using MoKα X-radiation and a CCD-based area detector. The crystal structures were refined by full-matrix least-squares techniques on the basis of F² to agreement indices (DabcoUAs, TriethUAs, PiperUP) wR₂=5.6%, 8.3%, 7.2% for all data, and R₁=2.9%, 3.3%, 4.0%, calculated for 1777, 5822, 9119 unique observed reflections (|F_o|?4σ_F), respectively. DabcoUAs is monoclinic, space group C2/m, Z=2, a=18.581(1), b=7.1897(4), c=7.1909(4) Å, β=102.886(1)°, V=936.43(9) Å³, D_calc=3.50 g/cm³. TriethUAs is monoclinic, space group P2₁/n, Z=4, a=9.6359(4), b=18.4678(7), c=10.0708(4) Å, β=92.282(1)°, V=1790.7(1) Å³, D_calc=3.41 g/cm³. PiperUP is monoclinic, space group Pn, Z=2, a=9.3278(4), b=15.5529(7), c=9.6474(5) Å, β=93.266(1)°, V=1397.3(1) Å³, D_calc=4.41 g/cm³. The structure of DabcoUAs contains the autunite-type sheet formed by the sharing of vertices between uranyl square bipyramids and arsenate tetrahedra. The triethylenediammonium cations are located in the interlayer along with two H₂O groups and are disordered. Both TriethUAs and PiperUP contain sheets formed of uranyl pentagonal bipyramids and tetrahedra (arsenate and phosphate, respectively) with the uranophane sheet-anion topology. In TriethUAs, triethlyammonium cations are located in the interlayer. In PiperUP, the sheets are connected by a uranyl pentagonal bipyramid that shares corners with phosphate tetrahedra of adjacent sheets, resulting in a framework with piperazinium cations and H₂O groups in the cavities of the structure.